Conditioned Unification for Natural Language Processing
نویسنده
چکیده
A]]STV~ACT This paper prescnLs what wc c.all a condiLiol'md unification, a r'm'w meLhod of unificatiol'~ for processing natural languages. The key idea is to annotate Lhe patterns wiLh a cerLcdn sort of conditions, so that they carry abundant inforrnation. ']'his met.bed t.ransmits inforrnaLion frorn one pattern to another more efl'icienLly Lhan proecdurc aLLachmenLs, in which information cortLaincd in the procedure is embcddcd in the progranl rather Lhan dirccl./y aLLachcd Lo paLL(ms Coupled wilt techniques in forrnal linguistics> i]]orcovcr, conditiorled unification serves most. types o1" opcrations for natlu'ai ]ar/guage processil'q~,.
منابع مشابه
Morpho-Phonological Modelling in Natural Language Processing
In this paper we propose a computational model for the representation and processing of morpho-phonological phenomena in a natural language, like Modern Greek. We aim at a unified treatment of inflection, compounding, and word-internal phonological changes, in a model that is used for both analysis and generation. After discussing certain difficulties cuase by well-known finitestate approaches,...
متن کاملNon-expert access to unification based speech understanding
This paper describes the concepts behind a sub grammar design tool being developed within the EU-funded language-engineering project REWARD. The tool is a sub-component of a general platform for designing spoken language systems and addresses dialogue designers who are non-experts in natural language processing and speech technology. Yet, the tool interfaces to a powerful and “professional” uni...
متن کاملA flexible by Gosse Bouma Esther
A graph-unification-based representation language is described that was developed as the grammar formalism for the LILOG research project at IBM Germany. The Stuttgart Unification Formalism (STUF) differs from its predecessors in its higher flexibility and its algebraic structure. It is well suited for the implementation of rather different linguistic approaches, but is currently employed mainl...
متن کاملSlot Unification Grammar and Anaphora Resolution
In this paper we propose a framework which we call Slot Unification Grammar (SUG). This framework allows to integrate different kinds of knowledge, all of them necessary for the resolution of several problems in Natural Language Processing (NLP). These problems, such as coordination, extraposition of constituents, ellipsis and anaphora, sometimes occur simultaneously and it is very useful to so...
متن کاملEffective Exploitation of Parallelism in NLP
The increasing demand for accuracy and robustness for today’s natural language processing systems brings on an increasing demand for computing power. Experiments on our unification-based parser indicated that only fine-grained parallelism could yield acceptable speedup. We present a parallelization technique to exploit this fine-grained parallelism. Although the approach was designed for the pa...
متن کامل